A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems
نویسندگان
چکیده
In economic model predictive control of distributed energy systems, the constrained optimal control problem can be expressed as a linear program with a block-angular structure. In this paper, we present an efficient Dantzig-Wolfe decomposition algorithm specifically tailored to problems of this type. Simulations show that a MATLAB implementation of the algorithm is significantly faster than several state-of-the-art linear programming solvers and that it scales in a favorable way.
منابع مشابه
A Dantzig-Wolfe Decomposition Algorithm for Linear Economic MPC of a Power Plant Portfolio
Future power systems will consist of a large number of decentralized power producers and a large number of controllable power consumers in addition to stochastic power producers such as wind turbines and solar power plants. Control of such large scale systems requires new control algorithms. In this paper, we formulate the control of such a system as an Economic Model Predictive Control (MPC) p...
متن کاملA Reduced Dantzig-Wolfe Decomposition for a Suboptimal Linear MPC
Linear Model Predictive Control (MPC) is an efficient control technique that repeatedly solves online constrained linear programs. In this work we propose an economic linear MPC strategy for operation of energy systems consisting of multiple and independent power units. These systems cooperate to meet the supply of power demand by minimizing production costs. The control problem can be formulat...
متن کاملEarly Termination of Dantzig-Wolfe Algorithm for Economic MPC
In this paper we apply the Economic Model Predictive Control (MPC) for balancing the power supply and demand in the future power systems in the most economic way. The control problem is formulated as a linear program, having a block-angular structure solved by the implementation of the Dantzig-Wolfe decomposition. For real-time applications we introduce an early termination technique. Simulatio...
متن کاملAn Efficient Parallel Algorithm for Linear Programming Problems
This study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the new algorithm, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also prov...
متن کاملDantzig-wolfe Decomposition with Gams
This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS.
متن کامل